Spatial Logics for Semistructured Resources

نویسندگان

  • Giovanni Conforti
  • Silvano Dal-Zilio
  • Andrea Maggiolo-Schettini
چکیده

Spatial Logics have been recently proposed as modal logics inspecting the ‘spatial’ nature of models (as opposed to ‘temporal logics’ inspecting model behavior). Spatial Logics, essentially, lift constructors (and structural properties) of underlying models to the logical level, obtaining new ‘spatial’ logical connectives. The semantics of spatial logics is model dependant: different properties in the model turn into different spatial connectives. The main aim of this thesis is an in-depth understanding of Spatial Logics, in particular about the notion of separation and abstraction in different models and their influence in the decidability of the logic. The new meta-model of bigraphs (proposed by Milner recently) is more general and more extensible than the models studied for spatial logics so far. We propose a general meta-logical framework, BiLog, inspired by the bigraphical structure. BiLog is contextual and parametric wrt structure and congruence of the model. This framework is interesting for spatial logics comparison and is very promising being a primary step for a truly general logic for distributed calculi with semistructured resources. We instantiate BiLog to describe bigraphs and their components and we show that the resulting logics naturally embed Spatial Logics previously proposed in literature. We also study how the introduction of name abstraction in the model and of quantifiers in the logic influences the decidability problem in Spatial Logics. Finally, we hint how Spatial Logics can be applied to model, describe and reason about a particular kind of semistructured resource: Web data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manipulating Trees with Hidden Labels

1.1 Languages for Semistructured Data XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15]. Traditional type systems are grounded on mathematical constructions such as cartesian products, disjoint unions, function spaces, and recursive types. The type systems for semistructured data, in contrast, res...

متن کامل

Spatial Tree Logics to reason about Semistructured Data

The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is, essentially, a spatial logic for unordered labeled trees, hence it turns out to be a good foundation for expressing properties of tree-shaped data (i.e. semistructured data and XML). The Tree Query Language (TQL) is ...

متن کامل

Manipulating Trees with Hidden Labels (Fossacs Updated Version).fm

XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15]. Traditional type systems are grounded on mathematical constructions such as cartesian products, disjoint unions, function spaces, and recursive types. The type systems for semistructured data, in contrast, resemble grammars or logics, with untagge...

متن کامل

Manipulating Trees with Hidden Labels (Fossacs Updated Version).fm

XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15]. Traditional type systems are grounded on mathematical constructions such as cartesian products, disjoint unions, function spaces, and recursive types. The type systems for semistructured data, in contrast, resemble grammars or logics, with untagge...

متن کامل

Manipulating Trees with Hidden Labels.fm

XML and semistructured data [1] are inspiring a new generation of programming and query languages based on more flexible type systems [26, 5, 6, 15]. Traditional type systems are grounded on mathematical constructions such as cartesian products, disjoint unions, function spaces, and recursive types. The type systems for semistructured data, in contrast, resemble grammars or logics, with untagge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005